package leetcode_201_220;

import leetcode_181_200.*;
import org.junit.Test;
import utils.ListNode;
import utils.TreeNode;

public class Test11 {

    @Test
    //数字范围按位与
    public void test201() {
        int left=5,right=7;
        System.out.println(new rangeBitwiseAnd_201().rangeBitwiseAnd(left,right));
    }

    @Test
    //快乐数
    public void test202() {
        System.out.println(new isHappy_202().isHappy(2));
    }

    @Test
    //计数质数
    public void test204() {
        System.out.println(new countPrimes_204().countPrimes2(10));
    }

    @Test
    //同构字符串
    public void test206() {
        ListNode head1=new ListNode(1);
        ListNode head2=new ListNode(2);
        ListNode head3=new ListNode(3);
        head1.next=head2;
        head2.next=head3;
        System.out.println(new reverseList_206().reverseList(head1));
    }

    @Test
    //计数质数
    public void test209() {
        int []nums={1,2,3,4,5};
        System.out.println(new minSubArrayLen_209().minSubArrayLen2(15, nums));
    }


}
